0.12/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.12/0.12 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 240 THM 0.12/0.33 % Computer : n006.cluster.edu 0.12/0.33 % Model : x86_64 x86_64 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 % Memory : 8042.1875MB 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 1920 0.12/0.33 % WCLimit : 240 0.12/0.33 % DateTime : Wed Jul 30 02:03:34 EDT 2025 0.19/0.33 % CPUTime : 0.20/0.48 Running higher-order theorem proving 0.20/0.49 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox2/tmp/tmp.dkS2PRaGMw/E---3.1_11333.p 0.20/0.50 # Version: 3.0.0-ho 0.20/0.50 # Preprocessing class: HSSSSMSSSSMCSSN. 0.20/0.50 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.20/0.50 # Starting post_as_ho5 with 1200s (5) cores 0.20/0.50 # Starting sh5l with 240s (1) cores 0.20/0.50 # Starting post_as_ho10 with 240s (1) cores 0.20/0.50 # Starting post_as_ho4 with 240s (1) cores 0.20/0.50 # post_as_ho5 with pid 11471 completed with status 0 0.20/0.50 # Result found by post_as_ho5 0.20/0.50 # Preprocessing class: HSSSSMSSSSMCSSN. 0.20/0.50 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.20/0.50 # Starting post_as_ho5 with 1200s (5) cores 0.20/0.50 # SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true) 0.20/0.50 # Search class: HUUNF-FFSF11-DSSFFFNN 0.20/0.50 # partial match(1): HUUNF-FFSF11-SSSFFFNN 0.20/0.50 # Scheduled 6 strats onto 5 cores with 1200 seconds (1200 total) 0.20/0.50 # Starting new_ho_10 with 649s (1) cores 0.20/0.50 # Starting post_as_ho5 with 121s (1) cores 0.20/0.50 # Starting new_bool_1 with 109s (1) cores 0.20/0.50 # Starting new_bool_2 with 109s (1) cores 0.20/0.50 # Starting new_bool_9 with 109s (1) cores 0.20/0.50 # new_ho_10 with pid 11476 completed with status 10 0.20/0.50 # Starting sh5l with 103s (1) cores 0.20/0.50 # new_bool_1 with pid 11479 completed with status 10 0.20/0.50 # new_bool_2 with pid 11480 completed with status 10 0.20/0.50 # post_as_ho5 with pid 11477 completed with status 0 0.20/0.50 # Result found by post_as_ho5 0.20/0.50 # Preprocessing class: HSSSSMSSSSMCSSN. 0.20/0.50 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.20/0.50 # Starting post_as_ho5 with 1200s (5) cores 0.20/0.50 # SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true) 0.20/0.50 # Search class: HUUNF-FFSF11-DSSFFFNN 0.20/0.50 # partial match(1): HUUNF-FFSF11-SSSFFFNN 0.20/0.50 # Scheduled 6 strats onto 5 cores with 1200 seconds (1200 total) 0.20/0.50 # Starting new_ho_10 with 649s (1) cores 0.20/0.50 # Starting post_as_ho5 with 121s (1) cores 0.20/0.50 # Preprocessing time : 0.001 s 0.20/0.50 # Presaturation interreduction done 0.20/0.50 0.20/0.50 # Proof found! 0.20/0.50 # SZS status Theorem 0.20/0.50 # SZS output start CNFRefutation 0.20/0.50 thf(decl_23, type, cP: $i > $i > $o). 0.20/0.50 thf(decl_24, type, cE: ($i > $o) > $i). 0.20/0.50 thf(cTHM19SK1, conjecture, ~((![X1:$i]:((cP @ X1 @ (cE @ (^[X2:$i]:((cP @ X1 @ X2))))))&![X3:$i > $i]:(~((cP @ (cE @ (^[X1:$i]:(~((cP @ X1 @ (X3 @ X1)))))) @ (X3 @ (cE @ (^[X1:$i]:(~((cP @ X1 @ (X3 @ X1)))))))))))), file('/export/starexec/sandbox2/tmp/tmp.dkS2PRaGMw/E---3.1_11333.p', cTHM19SK1)). 0.20/0.50 thf(c_0_1, negated_conjecture, ~(~((![X1:$i]:((cP @ X1 @ (cE @ (^[Z0/* 3 */:$i]:((cP @ X1 @ Z0))))))&![X3:$i > $i]:(~(cP @ (cE @ (^[Z0/* 7 */:$i]:(~((cP @ Z0 @ (X3 @ Z0)))))) @ (X3 @ (cE @ (^[Z0/* 7 */:$i]:(~((cP @ Z0 @ (X3 @ Z0)))))))))))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM19SK1])])])). 0.20/0.50 thf(c_0_2, negated_conjecture, ![X6:$i, X7:$i > $i]:(((cP @ X6 @ (cE @ (^[Z0/* 3 */:$i]:((cP @ X6 @ Z0)))))&~(cP @ (cE @ (^[Z0/* 7 */:$i]:(~((cP @ Z0 @ (X7 @ Z0)))))) @ (X7 @ (cE @ (^[Z0/* 7 */:$i]:(~((cP @ Z0 @ (X7 @ Z0)))))))))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])). 0.20/0.50 thf(c_0_3, negated_conjecture, ![X3:$i > $i]:(~((cP @ (cE @ (^[Z0/* 7 */:$i]:(~((cP @ Z0 @ (X3 @ Z0)))))) @ (X3 @ (cE @ (^[Z0/* 7 */:$i]:(~((cP @ Z0 @ (X3 @ Z0)))))))))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.20/0.50 thf(c_0_4, negated_conjecture, ![X1:$i]:((cP @ X1 @ (cE @ (cP @ X1)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.20/0.50 thf(c_0_5, negated_conjecture, ($false), inference(spm,[status(thm)],[c_0_3, c_0_4]), ['proof']). 0.20/0.50 # SZS output end CNFRefutation 0.20/0.50 # Parsed axioms : 3 0.20/0.50 # Removed by relevancy pruning/SinE : 2 0.20/0.50 # Initial clauses : 2 0.20/0.50 # Removed in clause preprocessing : 0 0.20/0.50 # Initial clauses in saturation : 2 0.20/0.50 # Processed clauses : 4 0.20/0.50 # ...of these trivial : 0 0.20/0.50 # ...subsumed : 0 0.20/0.50 # ...remaining for further processing : 4 0.20/0.50 # Other redundant clauses eliminated : 0 0.20/0.50 # Clauses deleted for lack of memory : 0 0.20/0.50 # Backward-subsumed : 0 0.20/0.50 # Backward-rewritten : 0 0.20/0.50 # Generated clauses : 1 0.20/0.50 # ...of the previous two non-redundant : 0 0.20/0.50 # ...aggressively subsumed : 0 0.20/0.50 # Contextual simplify-reflections : 0 0.20/0.50 # Paramodulations : 1 0.20/0.50 # Factorizations : 0 0.20/0.50 # NegExts : 0 0.20/0.50 # Equation resolutions : 0 0.20/0.50 # Disequality decompositions : 0 0.20/0.50 # Total rewrite steps : 0 0.20/0.50 # ...of those cached : 0 0.20/0.50 # Propositional unsat checks : 0 0.20/0.50 # Propositional check models : 0 0.20/0.50 # Propositional check unsatisfiable : 0 0.20/0.50 # Propositional clauses : 0 0.20/0.50 # Propositional clauses after purity: 0 0.20/0.50 # Propositional unsat core size : 0 0.20/0.50 # Propositional preprocessing time : 0.000 0.20/0.50 # Propositional encoding time : 0.000 0.20/0.50 # Propositional solver time : 0.000 0.20/0.50 # Success case prop preproc time : 0.000 0.20/0.50 # Success case prop encoding time : 0.000 0.20/0.50 # Success case prop solver time : 0.000 0.20/0.50 # Current number of processed clauses : 2 0.20/0.50 # Positive orientable unit clauses : 1 0.20/0.50 # Positive unorientable unit clauses: 0 0.20/0.50 # Negative unit clauses : 1 0.20/0.50 # Non-unit-clauses : 0 0.20/0.50 # Current number of unprocessed clauses: 0 0.20/0.50 # ...number of literals in the above : 0 0.20/0.50 # Current number of archived formulas : 0 0.20/0.50 # Current number of archived clauses : 2 0.20/0.50 # Clause-clause subsumption calls (NU) : 0 0.20/0.50 # Rec. Clause-clause subsumption calls : 0 0.20/0.50 # Non-unit clause-clause subsumptions : 0 0.20/0.50 # Unit Clause-clause subsumption calls : 0 0.20/0.50 # Rewrite failures with RHS unbound : 0 0.20/0.50 # BW rewrite match attempts : 0 0.20/0.50 # BW rewrite match successes : 0 0.20/0.50 # Condensation attempts : 0 0.20/0.50 # Condensation successes : 0 0.20/0.50 # Termbank termtop insertions : 386 0.20/0.50 # Search garbage collected termcells : 43 0.20/0.50 0.20/0.50 # ------------------------------------------------- 0.20/0.50 # User time : 0.004 s 0.20/0.50 # System time : 0.008 s 0.20/0.50 # Total time : 0.012 s 0.20/0.50 # Maximum resident set size: 1844 pages 0.20/0.50 0.20/0.50 # ------------------------------------------------- 0.20/0.50 # User time : 0.005 s 0.20/0.50 # System time : 0.012 s 0.20/0.50 # Total time : 0.017 s 0.20/0.50 # Maximum resident set size: 1732 pages 0.20/0.50 % E exiting 0.20/0.50 % E exiting 0.20/0.51 EOF